admissible set

допустимое множество

English-Russian scientific dictionary. 2008.

Смотреть что такое "admissible set" в других словарях:

  • Admissible ordinal — In set theory, an admissible ordinal is any ordinal number α such that Lα is a standard set model of Kripke–Platek set theory. In this case, Lα is said to be an admissible set.The first two admissible ordinals are ω and omega 1^{mathrm{CK (the… …   Wikipedia

  • Admissible rule — In logic, a rule of inference is admissible in a formal system if the set of theorems of the system is closed under the rule. The concept of an admissible rule was introduced by Paul Lorenzen (1955).DefinitionsThe concept of admissibility, as… …   Wikipedia

  • Admissible decision rule — In classical (frequentist) decision theory, an admissible decision rule is a rule for making a decision that is better than any other rule that may compete with it, in a specific sense defined below. Generally speaking, in most decision problems… …   Wikipedia

  • Admissible representation — In mathematics, admissible representations are a well behaved class of representations used in the representation theory of reductive Lie groups over real or p adic fields. They were introduced by Harish Chandra.Real reductive groupsFor real… …   Wikipedia

  • set theory — the branch of mathematics that deals with relations between sets. [1940 45] * * * Branch of mathematics that deals with the properties of sets. It is most valuable as applied to other areas of mathematics, which borrow from and adapt its… …   Universalium

  • Kripke–Platek set theory — The Kripke–Platek axioms of set theory (KP) (IPAEng|ˈkrɪpki ˈplɑːtɛk) are a system of axioms of axiomatic set theory, developed by Saul Kripke and Richard Platek. The axiom system is written in first order logic; it has an infinite number of… …   Wikipedia

  • Kripke–Platek set theory with urelements — The Kripke–Platek set theory with urelements (KPU) is an axiom system for set theory with urelements that is considerably weaker than the familiar system ZF. PreliminariesThe usual way of stating the axioms presumes a two sorted first order… …   Wikipedia

  • Active set — En optimisation mathématique, un problème est défini en utilisant une fonction objectif à minimiser ou maximiser, et un ensemble de contraintes : qui définissent l espace de solutions admissibles qui est l ensemble des x à tester afin de… …   Wikipédia en Français

  • Cauchy-Binet formula — In linear algebra, the Cauchy Binet formula generalizes the multiplicativity of the determinant (the fact that the determinant of a product of two square matrices is equal to the product of the two determinants) to non square matrices. Suppose A… …   Wikipedia

  • Large countable ordinal — In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of… …   Wikipedia

  • A* search algorithm — In computer science, A* (pronounced A star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). It uses a distance plus cost heuristic function… …   Wikipedia


Другие книги по запросу «admissible set» >>

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.